A Natural–Norm Successive Constraint Method for Inf-Sup Lower Bounds
نویسندگان
چکیده
We present a new approach for the construction of lower bounds for the inf-sup stability constants required in a posteriori error analysis of reduced basis approximations to affinely parametrized partial differential equations. We combine the “linearized” inf-sup statement of the natural–norm approach with the approximation procedure of the Successive Constraint Method (SCM): the former (natural–norm) provides an economical parameter expansion and local concavity in parameter — a small(er) optimization problem which enjoys intrinsic lower bound properties; the latter (SCM) provides a systematic optimization framework — a Linear Program (LP) relaxation which readily incorporates continuity and stability constraints. The natural–norm SCM requires a parameter domain decomposition: we propose a greedy algorithm for selection of the SCM control points as well as adaptive construction of the optimal subdomains. The efficacy of the natural–norm SCM is illustrated through numerical results for two types of non-coercive problems: the Helmholtz equation (for acoustics, elasticity, and electromagnetics), and the convection–diffusion equation.
منابع مشابه
A Space-Time Petrov-Galerkin Certified Reduced Basis Method: Application to the Boussinesq Equations
We present a space-time certified reduced basis method for long-time integration of parametrized noncoercive parabolic equations with quadratic nonlinearity. We first consider a finite element discretization based on discontinuous Galerkin time integration and introduce associated Petrov-Galerkin space-time trialand test-space norms which yields optimal and asymptotically mesh independent stabi...
متن کاملAnalyse numérique/Numerical Analysis A Successive Constraint Linear Optimization Method for Lower Bounds of Parametric Coercivity and Inf-Sup Stability Constants
We present an approach to the construction of lower bounds for the coercivity and inf-sup stability constants required in a posteriori error analysis of reduced basis approximations to affinely parametrized partial differential equations. The method, based on an Offline-Online strategy relevant in the reduced basis many-query and real-time context, reduces the Online calculation to a small Line...
متن کاملSuccessive Constraint Method in the Collocation Reduced Basis Method
Parametric Partial Differential Equations arise in many areas of applied mathematics and the natural sciences. Efficient numerical simulations to these types of problems across a wide range of parameter values presents a stiff computational challenge. The Reduced Basis Method presents an efficient scheme for solving these types of problem. Utilization of this method however, depends on the know...
متن کاملA Space-Time Certified Reduced Basis Method for Burgers’ Equation
We present a space-time certified reduced basis method for Burgers’ equation over the spatial interval (0, 1) and the temporal interval (0, T ] parametrized with respect to the Peclet number. We first introduce a Petrov-Galerkin space-time finite element discretization, which enjoys a favorable inf-sup constant that decreases slowly with Peclet number and final time T . We then consider an hp i...
متن کاملOn the Inf Sup Condition of Mixed Finite Element Formulations for Acoustic Fluids
The objective of this paper is to present a study of the solvability, stability and optimal error bounds of certain mixed finite element formulations for acoustic fluids. An analytical proof of the stability and optimal error bounds of a set of three-field mixed finite element discretizations is given, and the interrelationship between the inf–sup condition, including the numerical inf–sup test...
متن کامل